Random orthogonal matrix simulation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Further properties of random orthogonal matrix simulation

Random orthogonal matrix (ROM) simulation is a very fast procedure for generating multivariate random samples that always have exactly the same mean, covariance and Mardia multivariate skewness and kurtosis. This paper investigates how the properties of parametric, data-specific and deterministic ROM simulations are influenced by the choice of orthogonal matrix. Specifically, we consider how cy...

متن کامل

Random block matrices and matrix orthogonal polynomials

In this paper we consider random block matrices, which generalize the general beta ensembles, which were recently investigated by Dumitriu and Edelmann (2002, 2005). We demonstrate that the eigenvalues of these random matrices can be uniformly approximated by roots of matrix orthogonal polynomials which were investigated independently from the random matrix literature. As a consequence we deriv...

متن کامل

Universality in Random Matrix Theory for Orthogonal and Symplectic Ensembles

Abstract. We give a proof of universality in the bulk for orthogonal (β = 1) and symplectic (β = 4) ensembles of random matrices in the scaling limit for a class of weights w(x) = e (x) where V is a polynomial, V (x) = κ2mx+· · · , κ2m > 0. For such weights the associated equilibrium measure is supported on a single interval. The precise statement of our results is given in Theorem 1.1 below. F...

متن کامل

Almost Orthogonal Submatrices of an Orthogonal Matrix

Let t ≥ 1 and let n, M be natural numbers, n < M. Let A = (a i,j) be an n × M matrix whose rows are orthonormal. Suppose that for all j M n · n i=1 a 2 i,j 1/2 ≤ t.

متن کامل

Generating Random Orthogonal Polygons

We propose two different methods for generating random orthogonal polygons with a given number of vertices. One is a polynomial time algorithm and it is supported by a technique we developed to obtain polygons with an increasing number of vertices starting from a unit square. The other follows a constraint programming approach and gives great control on the generated polygons. In particular, it...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2011

ISSN: 0024-3795

DOI: 10.1016/j.laa.2010.10.023